翻訳と辞書 Words near each other ・ Exponential growth ・ Exponential hierarchy ・ Exponential integral ・ Exponential integrate-and-fire ・ Exponential integrator ・ Exponential map ・ Exponential map (discrete dynamical systems) ・ Exponential map (Lie theory) ・ Exponential map (Riemannian geometry) ・ Exponential mechanism (differential privacy) ・ Exponential object ・ Exponential polynomial ・ Exponential random graph models ・ Exponential search ・ Exponential sheaf sequence ・ Exponential smoothing ・ Exponential stability ・ Exponential sum ・ Exponential Technology ・ Exponential time hypothesis ・ Exponential tree ・ Exponential type ・ Exponential utility ・ Exponential-Golomb coding ・ Exponential-logarithmic distribution ・ Exponentially closed field ・ Exponentially equivalent measures ・ Exponentially modified Gaussian distribution ・ Exponentiated Weibull distribution ・ Exponentiation Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Exponential smoothing ： ウィキペディア英語版 Exponential smoothing Exponential smoothing is a rule of thumb technique for smoothing time series data, particularly for recursively applying as many as three low-pass filters with exponential window functions. Such techniques have broad application that is not intended to be strictly accurate or reliable for every situation. It is an easily learned and easily applied procedure for approximately calculating or recalling some value, or for making some determination based on prior assumptions by the user, such as seasonality. Like any application of repeated low-pass filtering, the observed phenomenon may be an essentially random process, or it may be an orderly, but noisy, process. Whereas in the simple moving average the past observations are weighted equally, exponential window functions assign exponentially decreasing weights over time. The use of three filters is based on empirical evidence and broad application. Exponential smoothing is commonly applied to smooth data, as many window functions are in signal processing, acting as low-pass filters to remove high frequency noise. This method parrots Poisson's use of recursive exponential window functions in convolutions from the 19th century, as well as Kolmogorov and Zurbenko's use of recursive moving averages from their studies of turbulence in the 1940s. See Kolmogorov-Zurbenko filter for more information. The raw data sequence is often represented by $\backslash$ beginning at time $t\; =\; 0$, and the output of the exponential smoothing algorithm is commonly written as $\backslash$, which may be regarded as a best estimate of what the next value of $x$ will be. When the sequence of observations begins at time $t\; =\; 0$, the simplest form of exponential smoothing is given by the formulae:〔 $$ \begin s_0& = x_0\\ s_& = \alpha x_ + (1-\alpha)s_,\ t>0 \end where $\backslash alpha$ is the ''smoothing factor'', and . ==Background== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Exponential smoothing」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.